Flu Detector %2D Tracking Epidemics on Twitter.

Detecting Events in a Million New York Times Articles.

Reconstruction of Causal Networks by Set Covering

An Information%2DTheoretic Approach to Finding Informative Noisy Tiles in Binary Databases.

Reconstruction of Causal Networks by Set Covering



Inference and Validation of Networks.

Found in Translation.

An Intelligent Agent That Autonomously Learns How to Translate.

ModuleDigger an itemset mining framework for the detection of cis%2Dregulatory modules.

Explicit probabilistic models for databases and networks

Integrating Microarray and Proteomics Data to Predict the Response of Cetuximab in Patients with Rectal Cancer.
To investigate the combination of cetuximab, capecitabine and radiotherapy in the preoperative treatment of patients with rectal cancer, fourty tumour samples were gathered before treatment (T0), after one dose of cetuximab but before radiotherapy with capecitabine (T1) and at moment of surgery (T2). The tumour and plasma samples were subjected at all timepoints to Affymetrix microarray and Luminex proteomics analysis, respectively. At surgery, the Rectal Cancer Regression Grade (RCRG) was registered. We used a kernel-based method with Least Squares Support Vector Machines to predict RCRG based on the integration of microarray and proteomics data on T0 and T1. We demonstrated that combining multiple data sources improves the predictive power. The best model was based on 5 genes and 10 proteins at T0 and T1 and could predict the RCRG with an accuracy of 91.7%, sensitivity of 96.2 % and specificity of 80%. 1.
Discriminative Sequence Labeling by Z%2DScore Optimization.


Deploying SDP for machine learning.


Learning to Align A Statistical Approach.
Abstract. We present a new machine learning approach to the inverse parametric sequence alignment problem: given as training examples a set of correct pairwise global alignments, find the parameter values that make these alignments optimal. We consider the distribution of the scores of all incorrect alignments, then we search for those parameters for which the score of the given alignments is as far as possible from this mean, measured in number of standard deviations. This normalized distance is called the ‘Z-score ’ in statistics. We show that the Z-score is a function of the parameters and can be computed with efficient dynamic programs similar to the Needleman-Wunsch algorithm. We also show that maximizing the Z-score boils down to a simple quadratic program. Experimental results demonstrate the effectiveness of the proposed approach. 1
Kernel%2Dbased data fusion for gene prioritization.

MINI Mining Informative Non%2Dredundant Itemsets.

The Minimum Volume Covering Ellipsoid Estimation in Kernel%2DDefined Feature Spaces.

Fast SDP Relaxations of Graph Cut Clustering
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent developement, the relaxation of combinatorial problems to semi-definite programs (SDP), has gained considerable attention over the last decade (Helmberg, 2000; De Bie and Cristianini, 2004a). Although SDP problems can be solved in polynomial time, for many relaxations the exponent in the polynomial complexity bounds is too high for scaling to large problem sizes. This has hampered their uptake as a powerful new tool in machine learning. In this paper, we present a new and fast SDP relaxation of the normalized graph cut problem, and investigate its usefulness in unsupervised and semi-supervised learning. In particular, this provides a convex algorithm for transduction, as well as approaches to clustering. We further propose a whole cascade of fast relaxations that all hold the middle between older spectral relaxations and the new SDP relaxation, allowing one to trade off computational cost versus relaxation accuracy. Finally, we discuss how the methodology developed in this paper can be applied to other combinatorial problems in machine learning, and we treat the max-cut problem as an example.
Discovering Transcriptional Modules from Motif%2C Chip%2DChip and Microarray Data.

Kernel Methods for Exploratory Pattern Analysis A Demonstration on Text Data.

Learning from General Label Constraints.

A statistical framework for genomic data fusion.

Efficiently Learning the Metric with Side%2DInformation.
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this amounts to finding a suitable metric in the data space. In the supervised case, Linear Discriminant Analysis (LDA) can be used to find an appropriate subspace in which the data structure is apparent. Other ways to learn a suitable metric are found in [6] and [11]. However recently significant attention has been devoted to the problem of learning a metric in the semi-supervised case. In particular the work by Xing et al. [15] has demonstrated how semi-definite programming (SDP) can be used to directly learn a distance measure that satisfies constraints in the form of side-information. They obtain a significant increase in clustering performance with the new representation. The approach is very interesting, however, the computational complexity of the method severely limits its applicability to real machine learning tasks. In this paper we present an alternative solution for dealing with the problem of incorporating side-information. This side-information specifies pairs of examples belonging to the same class. The approach is based on LDA, and is solved by the efficient eigenproblem. The performance reached is very similar, but the complexity is only O(d 3) instead of O(d 6) where d is the dimensionality of the data. We also show how our method can be extended to deal with more general types of side-information. 1
Convex Methods for Transduction.
The 2-class transduction problem, as formulated by Vapnik [1],  involves finding a separating hyperplane for a labelled data set  that is also maximally distant from a given set of unlabelled test  points. In this form, the problem has exponential computational  complexity in the size of the working set. So far it has been attacked  by means of integer programming techniques [2] that do not scale  to reasonable problem sizes, or by local search procedures [3].
